The PN*-search algorithm: Application to tsume-shogi
نویسندگان
چکیده
This paper proposes a new search algorithm, denoted PN∗, for AND/OR tree search. The algorithm is based on proof-number (PN) search, a best-first search algorithm, proposed by Allis et al. [Artificial Intelligence 66 (1) (1994) 91–124], and on Korf’s RBFS algorithm [Artificial Intelligence 62 (1) (1993) 41–78]. PN∗ combines several existing ideas. It transforms a best-first PN-search algorithm into an iterative-deepening depth-first approach. Moreover, it is enhanced by methods such as recursive iterative deepening, dynamic evaluation, efficient successor ordering, and pruning by dependency relations. The resulting algorithm turns out to be highly efficient as witnessed by the experimental results. The PN∗ algorithm is implemented in a tsume-shogi (Japanese-chess mating-problem) program, and evaluated by testing it on 295 notoriously difficult tsume-shogi problems (one problem has a depth of search of over 1500 plies). The experimental results are compared with those of other programs. The PN∗ program shows by far the best results, solving all problems but one. Needless to say, it outperforms the best human tsume-shogi problem solvers by far. 2001 Elsevier Science B.V. All rights reserved.
منابع مشابه
THE PERFORMANCE OF PN*, PDS, AND PN SEARCH ON 6x6 OTHELLO AND TSUME-SHOGI
After PN search was developed and had achieved many successes for solving some hard problems, innovations to depth-first search algorithms were based on the idea of proof numbers. This article introduces two such innovative algorithms: PN* and PDS. The PN* algorithm was developed for solving Tsume-Shogi problems, among which one with more than 1500 steps. Then, PDS was proposed to strengthen th...
متن کاملDealing with Infinite Loops, Underestimation, and Overestimation of Depth-First Proof-Number Search
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domains with repetitions. Df-pn(r) cures it by ignoring proof and disproof numbers that may lead to infinite loops. This paper points out that df-pn(r) has a serious issue of underestimating proof and disproof numbers, while...
متن کاملA Survey of Tsume-Shogi Programs Using Variable-Depth Search
Recently, a number of programs have been developed that successfully apply variable-depth search to find solutions for mating problems in Japanese chess, called tsume shogi. Publications on this research domain have been written mainly in Japanese. To present the findings of this research to a wider audience, we compare six different tsume programs. To find the solutions of difficult tsume-shog...
متن کاملUsing Pattern Recognition and Selective Deepening to Solve Tsume Shogi
In chess brute-force search methods have been very successful. However, games like shogi have a game tree complexity that is much higher than chess. Therefore, it is unclear if the methods used for making strong chess programs will also be successful for other games. In our research we will attempt to use a more cognitively based method, pattern recognition, to build a strong shogi playing prog...
متن کاملComparison of Df-pn based Search Algorithms on Shogi Brinkmate Problems
The currently best method is the one by Nagai, using df-pn+ to solve brinkmate problems. We have proposed a new threat based and proof number based algorithm called df-pn driven λ-search. We have conducted some preliminary experiments, showing that df-pn driven λ-search seems to be better than Nagai’s method in solving Shogi brinkmate problems. Although more invesigation is requiered, df-pn λ-s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Artif. Intell.
دوره 129 شماره
صفحات -
تاریخ انتشار 2001